Post-Processing for MCMC

نویسندگان

  • Edwin D. de Jong
  • Marco A. Wiering
  • Mădălina M. Drugan
چکیده

Markov Chain Monte Carlo methods (MCMC) can sample from a target distribution and approximate this distribution. MCMC methods employ the apriori known unnormalized target distribution to decide on the acceptance of new states, but not to approximate the final distribution. This paper investigates how the unnormalized target distribution can be used for approximation purposes. It is shown that this function can be used to obtain an unbiased estimate of the target distribution. Under certain circumstances, this approach can greatly reduce the variance of the resulting estimate. A useful side-effect of our estimation method is that the sampling method no longer has to follow the target distribution. Based on this observation, a sampling method with a variable degree of exploration is described that still converges to the target function. Thus, exploration can be performed, thereby improving mixing, without discarding sample points. Both methods are demonstrated in experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Control Variates for Stochastic Gradient MCMC

It is well known that Markov chain Monte Carlo (MCMC) methods scale poorly with dataset size. We compare the performance of two classes of methods which aim to solve this issue: stochastic gradient MCMC (SGMCMC), and divide and conquer methods. We find an SGMCMC method, stochastic gradient Langevin dynamics (SGLD) to be the most robust in these comparisons. This method makes use of a noisy esti...

متن کامل

Uncertainty quantification for radio interferometric imaging: II. MAP estimation

Uncertainty quantification is a critical missing component in radio interferometric imaging that will only become increasingly important as the big-data era of radio interferometry emerges. Statistical sampling approaches to perform Bayesian inference, like Markov Chain Monte Carlo (MCMC) sampling, can in principle recover the full posterior distribution of the image, from which uncertainties c...

متن کامل

Orthogonal parallel MCMC methods for sampling and optimization

Monte Carlo (MC) methods are widely used in statistics, signal processing and machinelearning. A well-known class of MC methods are Markov Chain Monte Carlo (MCMC)algorithms. In order to foster better exploration of the state space, specially in high-dimensional applications, several schemes employing multiple parallel MCMC chains have beenrecently introduced. In this work, ...

متن کامل

lgcp: Inference with Spatial and Spatio-Temporal Log-Gaussian Cox Processes in R

This paper introduces an R package for spatial and spatio-temporal prediction and forecasting for log-Gaussian Cox processes. The main computational tool for these models is Markov chain Monte Carlo (MCMC) and the new package, lgcp, therefore also provides an extensible suite of functions for implementing MCMC algorithms for processes of this type. The modelling framework and details of inferen...

متن کامل

Model selection by MCMC computation

MCMC sampling is a methodology that is becoming increasingly important in statistical signal processing. It has been of particular importance to the Bayesian-based approaches to signal processing since it extends signi"cantly the range of problems that they can address. MCMC techniques generate samples from desired distributions by embedding them as limiting distributions of Markov chains. Ther...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003